Permutation Classes of Polynomial Growth
نویسندگان
چکیده
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterized as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue all such sets of forbidden permutations having three or fewer elements is provided together with bounds on the degrees of the associated enumerating polynomials.
منابع مشابه
Growth Rates of Geometric Grid Classes of Permutations
Geometric grid classes of permutations have proven to be key in investigations of classical permutation pattern classes. By considering the representation of gridded permutations as words in a trace monoid, we prove that every geometric grid class has a growth rate which is given by the square of the largest root of the matching polynomial of a related graph. As a consequence, we characterise t...
متن کاملSimple permutations of the classes Av(321, 3412) and Av(321, 4123) have polynomial growth
A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a class of permutations is a set of patterns, which is minimal under involvement and do not belong to the permutation. In this paper we prov...
متن کاملSimple permutations of the classes Av(321, 13524) and Av(321, 13452) have polynomial growth
A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a permutation is a pattern which is minimal under involvement and do not belong to the permutation. In this paper, we prove that the number ...
متن کاملOn Growth Rates of Closed Permutation Classes
A class of permutations Π is called closed if π ⊂ σ ∈ Π implies π ∈ Π, where the relation ⊂ is the natural containment of permutations. Let Πn be the set of all permutations of 1, 2, . . . , n belonging to Π. We investigate the counting functions n 7→ |Πn| of closed classes. Our main result says that if |Πn| < 2n−1 for at least one n ≥ 1, then there is a unique k ≥ 1 such that Fn,k ≤ |Πn| ≤ Fn,...
متن کاملOn growth rates of hereditary permutation classes
A class of permutations is called hereditary if implies where the relation is the natural containment of permutations Let n be the set of all permutations of n belonging to We investigate the counting functions n j nj of hereditary classes Our main result says that if j nj n for at least one n then there is a unique k such that Fn k j nj Fn k n c holds for all n with a constant c Here Fn k are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006